Loopy SAM
نویسندگان
چکیده
Smoothing approaches to the Simultaneous Localization and Mapping (SLAM) problem in robotics are superior to the more common filtering approaches in being exact, better equipped to deal with non-linearities, and computing the entire robot trajectory. However, while filtering algorithms that perform map updates in constant time exist, no analogous smoothing method is available. We aim to rectify this situation by presenting a smoothingbased solution to SLAM using Loopy Belief Propagation (LBP) that can perform the trajectory and map updates in constant time except when a loop is closed in the environment. The SLAM problem is represented as a Gaussian Markov Random Field (GMRF) over which LBP is performed. We prove that LBP, in this case, is equivalent to Gauss-Seidel relaxation of a linear system. The inability to compute marginal covariances efficiently in a smoothing algorithm has previously been a stumbling block to their widespread use. LBP enables the efficient recovery of the marginal covariances, albeit approximately, of landmarks and poses. While the final covariances are overconfident, the ones obtained from a spanning tree of the GMRF are conservative, making them useful for data association. Experiments in simulation and using real data are presented.
منابع مشابه
Loopy: Programmable and Formally Verified Loop Transformations
Abstract. This paper presents a system, Loopy, for programming loop transformations. Manual loop transformation can be tedious and errorprone, while fully automated methods do not guarantee improvements. Loopy takes a middle path: a programmer specifies a loop transformation at a high level, which is then carried out automatically by Loopy, and formally verified to guard against specification a...
متن کاملStatistical physics of loopy interactions: Independent-loop approximation and beyond
We consider an interacting system of spin variables on a loopy interaction graph, identified by a tree graph and a set of loopy interactions. We start from a high-temperature expansion for loopy interactions represented by a sum of non-negative contributions from all the possible frustration-free loop configurations. We then compute the loop corrections using different approximations for the no...
متن کاملLoopy belief propagation for approximate inference : an empiricalstudyKevin
Recently, a number of researchers have demonstrated excellent performance by using \loopy belief propagation" | using Pearl's polytree algorithm in a Bayesian network with loops. The most dramatic instance is the near Shannon-limit performance of \Turbo Codes" | error-correcting codes whose decoding algorithm is equivalent to loopy belief propagation. In this paper we ask: is there something sp...
متن کاملLoopy Games and Computation
Loopy Games and Computation by Aaron Nathan Siegel Doctor of Philosophy in Mathematics University of California, Berkeley Professor Elwyn Berlekamp, Chair Over the past three decades, computers have come to play a fundamental role in the study of combinatorial games. This dissertation introduces the first thorough application of computers to loopy games, those in which repetition is permitted. ...
متن کامل